Toward a categorization of tractable multiobjective combinatorial optimization problems
نویسندگان
چکیده
Multiobjective combinatorial optimization problems are known to be hard problems for two reasons: their decision versions are often NPcomplete and they are often intractable. Apart from this general observation, are there also variants or cases of multiobjective combinatorial optimization problems which are easy and, if so, what causes them to be easy? This article is a first attempt to provide an answer to these two questions. Thereby, a systematic description of reasons for easiness is envisaged rather than a mere collection of special cases. In particular, the borderline of easy and hard multiobjective optimization problems is explored.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملAn empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization
We have already proposed a similarity-based mating scheme to recombine extreme and similar parents for evolutionary multiobjective optimization. In this paper, we examine the effect of the similarity-based mating scheme on the performance of evolutionary multiobjective optimization (EMO) algorithms. First we examine which is better between recombining similar or dissimilar parents. Next we exam...
متن کاملVery Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is almost no study of VLSNS for multiobjective optimization. We show in this paper that this technique is very efficient for the resolution of multiobjective combinatorial optimization problems. Two problems are considered: the multiobjective multidimensional knapsack pr...
متن کامل2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems
In this paper, we propose a sufficient condition for a solution to be optimal for a 2-additive Choquet integral in the context of multiobjective combinatorial optimization problems. A 2-additive Choquet optimal solution is a solution that optimizes at least one set of parameters of the 2-additive Choquet integral. We also present a method to generate 2-additive Choquet optimal solutions of mult...
متن کاملOutput-sensitive Complexity of Multiobjective Combinatorial Optimization
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which suc...
متن کامل